|
In the mathematical field of graph theory, the Klein graphs are two different but related regular graphs, each with 84 edges. Each can be embedded in the orientable surface of genus 3, in which they form dual graphs. ==The cubic Klein graph== This graph is a 3-regular graph with 56 vertices and 84 edges, named after Felix Klein. It is a Hamiltonian graph. It has chromatic number 3, chromatic index 3, radius 6, diameter 6 and girth 7. It is also a 3-vertex-connected and a 3-edge-connected graph. It can be embedded in the genus-3 orientable surface (which can be represented as the Klein quartic), where it forms the "Klein map" with 24 heptagonal faces, Schläfli symbol 8. According to the ''Foster census'', the Klein graph, referenced as F056B, is the only cubic symmetric graph on 56 vertices which is not bipartite.〔.〕 It can be derived from the 28-vertex Coxeter graph. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Klein graphs」の詳細全文を読む スポンサード リンク
|